A Convergent Hybrid Decomposition Algorithm Model for SVM Training
نویسندگان
چکیده
منابع مشابه
An accelerated MDM algorithm for SVM training
In this work we will propose an acceleration procedure for the Mitchell–Demyanov–Malozemov (MDM) algorithm (a fast geometric algorithm for SVM construction) that may yield quite large training savings. While decomposition algorithms such as SVMLight or SMO are usually the SVM methods of choice, we shall show that there is a relationship between SMO and MDM that suggests that, at least in their ...
متن کاملA Lagrangian Decomposition Algorithm for Robust Green Transportation Location Problem
In this paper, a green transportation location problem is considered with uncertain demand parameter. Increasing robustness influences the number of trucks for sending goods and products, caused consequently, increase the air pollution. In this paper, two green approaches are introduced which demand is the main uncertain parameter in both. These approaches are addressed to provide a trade-off b...
متن کاملA hybrid model based on machine learning and genetic algorithm for detecting fraud in financial statements
Financial statement fraud has increasingly become a serious problem for business, government, and investors. In fact, this threatens the reliability of capital markets, corporate heads, and even the audit profession. Auditors in particular face their apparent inability to detect large-scale fraud, and there are various ways to identify this problem. In order to identify this problem, the majori...
متن کاملHybrid SOM-SVM Algorithm for Real Time Series Forecasting
In this paper we show a new on-line parametric model for time series forecasting based on VapnikChervonenkis (VC) theory. Using the strong connection between support vector machines (SVM) and Regularization theory (RT), we propose a regularization operator in order to obtain a suitable expansion of radial basis functions (RBFs) with the corresponding expressions for updating neural parameters. ...
متن کاملFinitely Convergent Decomposition Algorithms For
We study a class of two-stage stochastic integer programs with general integer vari4 ables in both stages and finitely many realizations of the uncertain parameters. Based on Benders’ 5 method, we propose a decomposition algorithm that utilizes Gomory cuts in both stages. The Go6 mory cuts for the second-stage scenario subproblems are parameterized by the first-stage decision 7 variables, i.e.,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Neural Networks
سال: 2009
ISSN: 1045-9227,1941-0093
DOI: 10.1109/tnn.2009.2020908